Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
نویسندگان
چکیده
Article history: Available online 10 April 2013
منابع مشابه
Fast Shortest Paths Algorithms in the Presence of Few Negative Arcs
The shortest paths problem on weighted directed graphs is one of the basic network optimization problems. Its importance is mainly due to its applications in various areas, such as communication and transportation. Given a source node s in a weighted directed graph G, with n nodes and m arcs, the single-source shortest path problem (SSSP, for short) from s is the problem of finding the minimum ...
متن کاملTwo fast algorithms for all-pairs shortest paths
In a large, dense network, the computation of the ‘distances’, i.e., the shortest path lengths between all pairs of nodes, can take a long time with algorithms known from the literature. We present two all-pairs shortest path algorithms, based on the equations of Bellman. These algorithms run fast, much faster than indicated by their time complexity bound of O(n2m), where n is the number of nod...
متن کاملPolynomial auction algorithms for shortest paths
In this paper we consider strongly polynomial variations of the auction algorithm for the single origin/many destinations shortest path problem. These variations are based on the idea of graph reduction, that is, deleting unnecessary arcs of the graph by using certain bounds naturally obtained in the course of the algorithm. We study the structure of the reduced graph and we exploit this struct...
متن کاملFast paths on dynamic road networks
A recent industrial challenge for traffic information providers is to be able to compute point-to-point shortest paths very efficiently on road networks involving millions of nodes and arcs, where the arc costs represent travelling times that are updated every few minutes when new traffic information is available. Such stringent constraints defy classic shortest path algorithms. In this paper w...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 24 شماره
صفحات -
تاریخ انتشار 2014